package text111;

public class Solution4 {
	public int search(int[] nums, int target) {
		int nub = 0;
		for (int i = 0; i < nums.length; i++) {
			if (nums[i]==target) {
				nub++;
			}
		}
		return nub;
    }
}
